Combining Landscape Approximation and Local Search in Global Optimization - Evolutionary Computation, 1999. CEC 99. Proceedings of the 1999 Congress on

نویسندگان

  • Ko-Hsin Liang
  • Xin Yao
چکیده

Local search techniques have been applied in variant global optimization methods. The effect of local search to the function landscape can make multimodal problems easier to solve. For evolutionary algorithms, the usage of the step size control concept normally will result in failure by the individual to escape from the local optima during the final stage. In this paper, we propose an algorithm combining landscape approximation and local search (LALS) which is designed to tackle those difficult multimodal problems. We demonstrate that LALS can solve problems with very rough landscapes and also that LALS has very good global reliability.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evolving Materialized Views in Data Warehouse - Evolutionary Computation, 1999. CEC 99. Proceedings of the 1999 Congress on

A data warehouse contains multiple views accessed by queries. One of the most important decisions in designing a data warehouse is the selection of materialized views for the purpose of efficiently implementing decision making. The search space for the selection of materialized views is exponentially large, therefore, heuristics have been used to search a small fraction of the space to get a ne...

متن کامل

Combining Landscape Approximation and Local Search in Global Optimization

Local search techniques have been applied in variant global optimization methods. The eeect of local search to the function landscape can make multimodal problems easier to solve. For evolutionary algorithms, the usage of the step size control concept normally will result in failure by the individual to escape from the local optima during the nal stage. In this paper, we propose an algorithm co...

متن کامل

Self-adaptive Differential Evolution with Sqp Local Search

In this paper we present experimental results of self-adaptive differential evolution algorithm hybridized with a local search method. The results of the proposed hybrid algorithm are evaluated on a set of benchmark functions provided by the IEEE Congress on Evolutionary Computation (CEC 2008) special session on Large Scale Global Optimization. Performance comparison of our algorithm with other...

متن کامل

The discrete gradient evolutionary strategy method for global optimization

Global optimization problems continue to he a challenge in computational mathematics. The field is progressing in two streams: deterministic and heuristic approaches. In this paper, we present a hybrid method that uses the discrete gradient method. which is a derivative free local search method, and evolutionary strategies. We show that the hybridization of the two methods is better than each o...

متن کامل

Collective Decision-Making by Bee Colonies as Model for Optimization - the OptBees Algorithm

This paper presents OptBees, a new bee-inspired algorithm for solving continuous optimization problems. Two key mechanisms for OptBees are introduced: 1) a local search step; and 2) a process of dynamic variation of the number of active bees that helps the algorithm to regulate the computational effort spent in the search and to achieve improved results. The performance of the algorithm was eva...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999